Complexity and Approximability of Quantified and Stochastic Constraint Satisfaction Problems
نویسندگان
چکیده
منابع مشابه
Quantified Constraint Satisfaction Problems: Closure Properties, Complexity, and Algorithms
There has been much prior work on understanding the complexity of the constraint satisfaction problem (CSP), a broad framework capturing many combinatorial problems. This paper studies the complexity of the quantified constraint satisfaction problem (QCSP), a natural and strict generalization of the CSP. The CSP can be viewed as the problem of deciding whether or not existentially quantified fo...
متن کاملThe Constraint Satisfaction Problem: Complexity and Approximability
During the past two decades, an impressive array of diverse methods from several different mathematical fields, including algebra, logic, analysis, probability theory, graph theory, and combinatorics, have been used to analyze both the computational complexity and approximabilty of algorithmic tasks related to the constraint satisfaction problem (CSP), as well as the applicability/limitations o...
متن کاملThe Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions
We give a clear picture of the tractability/intractability frontier for quantified constraint satisfaction problems (QCSPs) under structural restrictions. On the negative side, we prove that checking QCSP satisfiability remains PSPACE-hard for all known structural properties more general than bounded treewidth and for the incomparable hypergraph acyclicity. Moreover, if the domain is not fixed,...
متن کاملSolving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can be used to model combinatorial problems containing contingency or uncertainty. It allows for universally quantified variables that can model uncertain actions and events, such as the unknown weather for a future party, ...
متن کاملConstraint Satisfaction: The Approximability of Minimization Problems
This paper continues the work initiated by Creignou [5] and Khanna, Sudan and Williamson [15] who classify maximization problems derived from Boolean constraint satisfaction. Here we study the approximability of minimization problems derived thence. A problem in this framework is characterized by a collection F of “constraints” (i.e., functions f : f0; 1gk ! f0; 1g) and an instance of a problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Discrete Mathematics
سال: 2001
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00324-5